Bounding the radii of balls meeting every connected component of semi-algebraic sets
نویسندگان
چکیده
We prove explicit bounds on the radius of a ball centered at the origin which is guaranteed to contain all bounded connected components of a semi-algebraic set S ⊂ Rk defined by a quantifier-free formula involving s polynomials in Z[X1, . . . ,Xk] having degrees at most d, and whose coefficients have bitsizes at most τ . Our bound is an explicit function of s, d, k and τ , and does not contain any undetermined constants. We also prove a similar bound on the radius of a ball guaranteed to intersect every connected component of S (including the unbounded components). While asymptotic bounds of the form 2 O(k) on these quantities were known before, some applications require bounds which are explicit and which hold for all values of s, d, k and τ . The bounds proved in this paper are of this nature.
منابع مشابه
Algorithmic and topological aspects of semi-algebraic sets defined by quadratic polynomial
In this thesis, we consider semi-algebraic sets over a real closed field $R$ defined by quadratic polynomials. Semi-algebraic sets of $R^k$ are defined as the smallest family of sets in $R^k$ that contains the algebraic sets as well as the sets defined by polynomial inequalities, and which is also closed under the boolean operations (complementation, finite unions and finite intersections). We ...
متن کاملOn the number of homotopy types of fibres of a definable map
In this paper we prove a single exponential upper bound on the number of possible homotopy types of the fibres of a Pfaffian map in terms of the format of its graph. In particular, we show that if a semi-algebraic set S ⊂ Rm+n, where R is a real closed field, is defined by a Boolean formula with s polynomials of degree less than d, and π : Rm+n → Rn is the projection on a subspace, then the num...
متن کاملNew bounds on the
A classic result in real algebraic geometry due to Oleinik-Petrovsky, Thom and Milnor, bounds the topological complexity (the sum of the Betti numbers) of basic semi-algebraic sets. This bound is tight as one can construct examples having that many connected components. However, till now no signiicantly better bounds were known on the individual higher Betti numbers. In this paper we prove sepa...
متن کاملOn Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety
We consider a family of s polynomials, P = fP ; . . . ; P g; in k variables with coefficients in a real closed field R; each of degree at most d; and an algebraic variety V of real dimension k which is defined as the zero set of a polynomial Q of degree at most d. The number of semi-algebraically connected components of all non-empty sign conditions on P over V is bounded by s (O(d)) . In this ...
متن کاملComputing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets
In this paper we describe a singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Euler-Poincaré characteristic, were known before. No singly exponential algorithm was known for computing any of the individual Betti numbers other than the zero-th one. We also give algorithms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 45 شماره
صفحات -
تاریخ انتشار 2010